Computational reflection via mechanized logical deduction

In this paper, we show how a system for automated deduction can be given computational reeection, i.e. can aaect its own computation mechanism, by using the very same machinery implementing logical deduction. This feature, that we call computational reeection via mechanized logical deduction, provides both theoretical and practical advantages. First, the theorem prover can inspect, extend and modify its own underlying theorem proving strategies automatically. Second, mechanized logical deduction can be used to reason about the ways these strategies can be extended and modiied and to prove correctness statements. This opens up the possibility of building systems that are able to perform correct and safe reeective self-extension and self-modiication.